A shallow embedding of HyperCTL
نویسندگان
چکیده
3 Shallow embedding of HyperCTL* 3 3.1 Kripke structures and paths . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Shallow representations of formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.3 Reasoning rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 3.4 More derived operators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
منابع مشابه
Algorithms for Model Checking HyperLTL and HyperCTL ^*
We present an automata-based algorithm for checking finite state systems for hyperproperties specified in HyperLTL and HyperCTL⇤. For the alternation-free fragments of HyperLTL and HyperCTL⇤ the automaton construction allows us to leverage existing model checking technology. Along several case studies, we demonstrate that the approach enables the verification of real hardware designs for proper...
متن کاملUnifying Hyper and Epistemic Temporal Logics
In the literature, two powerful temporal logic formalisms have been proposed for expressing information-flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of epistemic logic. The other one, the so-called hyper logic, is more recent and subsumes many proposals from the literature. In an attempt to better understand how the...
متن کاملUnifying Hyper and Epistemic Temporal Logic
In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of epistemic logic. The other one, the so called hyper logic, is more recent and subsumes many proposals from the literature; it is based on explicit and simultaneous q...
متن کاملCertifying Machine Code Safety: Shallow Versus Deep Embedding
We formalise a simple assembly language with procedures and a safety policy for arithmetic overflow in Isabelle/HOL. To verify individual programs we use a safety logic. Such a logic can be realised in Isabelle/HOL either as shallow or deep embedding. In a shallow embedding logical formulas are written as HOL predicates, whereas a deep embedding models formulas as a datatype. This paper present...
متن کاملCombining deep and shallow embedding of domain-specific languages
When compiling embedded languages it is natural to use an abstract syntax tree to represent programs. This is known as a deep embedding and it is a rather cumbersome technique compared to other forms of embedding, typically leading to more code and being harder to extend. In shallow embeddings, language constructs are mapped directly to their semantics which yields more flexible and succinct im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014